/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
const ll mod = 1e9 + 7;
ll pre[maxn];
int n;
ll qmul(ll a, ll b)
{
    ll ret = 0;
    while (b)
    {
        if (b & 1)
            ret = (ret + a) % mod;
        b >>= 1;
        a = (a + a) % mod;
    }
    return ret;
}
ll qpow(ll a, ll b)
{
    ll ret = 1;
    while (b)
    {
        if (b & 1)
            ret = qmul(ret, a);
        b >>= 1ll;
        a = qmul(a, a);
    }
    return ret;
}
void init()
{
    pre[0] = 0;
    for (int i = 1; i <= n; i++)
    {
        pre[i] = i + pre[i - 1];
        pre[i] %= mod;
    }
}
int main()
{
    IOS;
    cin >> n;
    init();
    ll ans = 0;

    for (ll i = 1; i <= n; i++)
    {
        //cout << i << ":" << ans << endl;
        ans = pre[i] * qpow(i * i % mod, mod - 2) % mod * (2 * i - 1) % mod;
        ans %= mod;
    }
    ans = ans * qpow(n * n % mod, mod - 2) % mod;
    ans = (ans + mod) % mod;
    cout << ans << endl;

    cout << "my:" << 7ll * qpow(16, mod - 2) % mod << endl;
    getchar();
    getchar();
    return 0;
}
